a-Logic With Arrows

نویسندگان

  • Murdoch James Gabbay
  • Michael Gabbay
چکیده

We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-rules for it, we demonstrate cut-elimination for the resulting logic, and we give a semantics for which the logic is sound and complete. Because we can now make assertions about what would normally be considered an intensional property of a term (being a variable symbol) we can now express inside the logic, properties of its terms and predicates which would normally be external to the logic. We give axiomatisations in a-logic, including of the lambdacalculus, and discuss what relevance this might have to logic programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reactive standard deontic logic

We introduce a reactive variant of SDL (standard deontic logic): SDLR1 (reactive standard deontic logic). Given a Kripkean view on the semantics of SDL in terms of directed graphs where arrows → represent the accessibility relation between worlds, reactive models add two elements: arrows → are labelled as “active” or “inactive”, and double arrows ։ connect arrows, e.g., (x1 → x2) ։ (x3 → x4). T...

متن کامل

Correct Looping Arrows from Cyclic Terms - Traced Categorical Interpretation in Haskell

Arrows involving a loop operator provide an interesting programming methodology for looping computation. On the other hand, Haskell can define cyclic data structures by recursive definitions. This paper shows that there exists a common principle underlying both cyclic data and cyclic computations of arrow programs. We examine three concrete examples of constructing looping arrows from a syntact...

متن کامل

Reactive Preferential Structures and Nonmonotonic Consequence

We introduce Information Bearing Relation Systems (IBRS) as an abstraction of many logical systems. We then define a general semantics for IBRS, and show that a special case of IBRS generalizes in a very natural way preferential semantics and solves open representation problems for weak logical systems. This is possible, as we can ”break” the strong coherence properties of preferential structur...

متن کامل

Categorical semantics for arrows

Arrows are an extension of the well-established notion of a monad in functional programming languages. This article presents several examples and constructions, and develops denotational semantics of arrows as monoids in categories of bifunctors C×C→ C. Observing similarities to monads – which are monoids in categories of endofunctors C→ C – it then considers Eilenberg-Moore and Kleisli constru...

متن کامل

An emergence of formal logic induced by an internal agent

In this paper, we mainly address three issues: externality of an agent, purpose of an agent, and a kind of "softness" of components in a system. Agents are independent of a system in an ordinary multi-agent model, hence the behavior of a system is not autonomous but influenced by the agents. If a multi-agent model is considered as a completely autonomous one, agents in the model are inevitably ...

متن کامل

Network Modalities: an exploration paper

The aim of this paper is to bring together several kinds of formalisms widely used in artificial intelligence and computer science, which up to now have been evolved in virtual independence from one another. We have in mind, on the one hand, the communities that use a variety of network models and, on the other hand, the modal logic community. Networks have different uses. We have Bayesian netw...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 216  شماره 

صفحات  -

تاریخ انتشار 2008